Solving Path Planning Problem by an ACO-PSO Hybrid Algorithm
نویسندگان
چکیده
An ACO-PSO Hybrid Algorithm Solving Path Planning Problem based on Swarm Intelligence (SI) is proposed. The problem first is described and some corresponding definitions are presented. Ant colony optimization (ACO) is used to establish the corresponding solution, and some material algorithm steps are set out. Particle swarm optimization (PSO) is applied to optimize the parameters in ACO, and parameters can be selected selfadaptively. Through the steps above, algorithm performance can be greatly enhanced and the reliability of parameters selecting can be guaranteed. At last simulation experiments are carried out, and the results prove the veracity of the algorithm.
منابع مشابه
SmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots
Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an...
متن کاملA Novel Hybrid Optimization Algorithm and its Application in Solving Complex Problem
Ant colony optimization (ACO) algorithm is a new heuristic algorithm which has been demonstrated a successful technology and applied to solving complex optimization problems. But the ACO exists the low solving precision and premature convergence problem, particle swarm optimization (PSO) algorithm is introduced to improve performance of the ACO algorithm. A novel hybrid optimization (HPSACO) al...
متن کاملHybrid Aco-pso for Robotic Path Planning
In the context of robotic path planning, a common strategy is to assume that the world is static and believed on heuristic approaches and obstacle avoidance to deal with changes in the environment. When planning is not considered for potential changes of the environment into account usually leads to poor performances. In this paper, we propose a hybrid ACO-PSO approach that exploits the travers...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کامل